New results for Domineering from combinatorial game theory endgame databases
نویسندگان
چکیده
We have constructed endgame databases for all single-component positions up to 15 squares for Domineering. These databases have been filled with exact Combinatorial Game Theory (CGT) values in canonical form. We give an overview of several interesting types and frequencies of CGT values occurring in the databases. The most important findings are as follows. First, as an extension of Conway’s [8] famous Bridge Splitting Theorem for Domineering, we state and prove another theorem, dubbed the Bridge Destroying Theorem for Domineering. Together these two theorems prove very powerful in determining the CGT values of large single-component positions as the sum of the values of smaller fragments, but also to compose larger single-component positions with specified values from smaller fragments. Using the theorems, we then prove that for any dyadic rational number there exist single-component Domineering positions with that value. Second, we investigate Domineering positions with infinitesimal CGT values, in particular ups and downs, tinies and minies, and nimbers. In the databases we find many positions with single or double up and down values, but no ups and downs with higher multitudes. However, we prove that such single-component ups and downs easily can be constructed, in particular that for any multiple up n·↑ or down n·↓ there are Domineering positions of size 1+5n with these values. Further, we find Domineering positions with 11 different tinies and minies values. For each we give an example. Next, for nimbers we find many Domineering positions with values up to *3. This is surprising, since Drummond-Cole [10] suspected that no *2 and *3 positions in standard Domineering would exist. We show and characterize many *2 and *3 positions. Finally, we give some Domineering positions with values interesting for other reasons. Third, we have investigated the temperature of all positions in our databases. There appears to be exactly one position with temperature 2 (as already found before) and no positions with temperature larger than 2. This supports Berlekamp’s conjecture that 2 is the highest possible temperature in Domineering. ∗Corresponding author. Email address: [email protected] (J.W.H.M. Uiterwijk) Preprint submitted to Elsevier June 11, 2015
منابع مشابه
Decomposition Search: A Combinatorial Games Approach to Game Tree Search, with Applications to Solving Go Endgames
We develop a new method called decomposition search for computing minimax solutions to games that can be partitioned into independent subgames. The method does not use traditional minimax search algorithms such as alpha-beta, but relies on concepts from combinatorial game theory to do locally restricted searches. This divide-and-conquer approach allows the exact solution of much larger problems...
متن کاملProject Ideas
I am happy to supervise projects in any area of combinatorics or algebra. This document gives some possible subjects. Most could be adapted to be suitable as either a 3rd year, 4th year or MSc project. Combinatorial game theory. In the game of Domineering the two players are called Horizontal and Vertical. In each turn, Vertical places a domino vertically on the board, and then Horizontal place...
متن کاملExperiments in Computer Amazons
Amazons is a relatively new game with some similarities to the ancient games of chess and Go. The game has become popular recently with combinatorial games researchers as well as in the computer games community. Amazons combines global full-board with local combinatorial game features. In the opening and early middle game, the playing pieces roam freely across the whole board, but later in the ...
متن کاملSolving the Game of Awari using Parallel Retrograde Analysis
We have solved the game of awari, an ancient African board game that is played worldwide now. The game is a draw when both players play optimally. To solve awari, we computed several databases that can be used jointly to select the best move from any position that can occur in a game. The largest database contains 204 billion entries (178 gigabyte), and is much larger than the largest (endgame)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Theor. Comput. Sci.
دوره 592 شماره
صفحات -
تاریخ انتشار 2015